#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

const int maxsize = 5 * 10e5 + 5;
int n, a, b, j = 0;
int mid, y, k;
int arr[maxsize];
bool check(int x)
{
    int k = 0;
    for (int i = 1; i <= n; i++)
    {
        j = arr[i] - a * mid;
        if (j <= 0)
            continue;
        y = j / b;
        if (j % b != 0)
            y++;
        k += y;
        if (k > mid)
            return false;
    }
    if (k <= mid)
        return true;
    else
        return false;
}
int main()
{
    scanf("%d%d%d", &n, &a, &b);
    for (int i = 1; i <= n; i++)
    {
        scanf("%d", &arr[i]);
    }
    //sort(arr, arr + n + 1);
    int l = 0, r = b;
    while (l != r)
    {
        mid = (l + r) >> 2;
        if (check(mid))
            r = mid;
        else
            l = mid + 1;
    }
    cout << l;
    return 0;
}